Maslov's inverse method and decidable classes
نویسندگان
چکیده
منابع مشابه
Decidable Equational Classes
I will discuss the progress that has been made on solving two open problems dealing with the decidability of the first order theory of equationally defined classes of algebras (varieties).
متن کاملEnumerations of Pi10 Classes: Acceptability and Decidable Classes
A Π1 class is an effectively closed set of reals. One way to view it is as the set of infinite paths through a computable tree. We consider the notion of acceptably equivalent numberings of Π1 classes. We show that a permutation exists between any two acceptably equivalent numberings that preserves the computable content. Furthermore the most commonly used numberings of the Π1 classes are accep...
متن کاملDecidable and Expressive Classes of Probabilistic Automata
Hierarchical probabilistic automata (HPA) are probabilistic automata whose states are partitioned into levels such that for any state and input symbol, at most one transition with non-zero probability goes to a state at the same level, and all others go to states at a higher level. We present expressiveness and decidability results for 1-level HPAs that work on both finite and infinite length i...
متن کاملDecidable discriminator varieties from unary classes
Let /C be a class of (universal) algebras of fixed type. /C* denotes the class obtained by augmenting each member of K, by the ternary discriminator function (/(x,y, z) = x if x / ?/, ^(x,x,z) = 2:), while V(/C*) is the closure of /C* under the formation of subalgebras, homomorphic images, and arbitrary Cartesian products. For example, the class of Boolean algebras is definitionally equivalent ...
متن کاملDecidable classes of documents for XPath
We study the satisfiability problem for XPath over XML documents of bounded depth. We define two parameters, called match width and braid width, that assign a number to any class of documents. We show that for all k, satisfiability for XPath restricted to bounded depth documents with match width at most k is decidable; and that XPath is undecidable on any class of documents with unbounded braid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1989
ISSN: 0168-0072
DOI: 10.1016/0168-0072(89)90053-5